Binary Tree


Q41.

Choose the correct alternatives (More than one may be correct).The total external path length, EPL, of a binary tree with n external nodes is, \Sigma _w=Iw, where I_{w} is the path length of external node w),
GateOverflow

Q42.

Which of the following statements is false?
GateOverflow

Q43.

Which of the following statements is false?
GateOverflow

Q44.

Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right subtrees, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?
GateOverflow

Q45.

Choose the correct alternatives (More than one may be correct).The number of rooted binary trees with n nodes is,
GateOverflow

Q46.

Which of the following sequences denotes the post order traversal sequence of the below tree?
GateOverflow

Q47.

Answer the following:Which one of the following statements (s) is/are FALSE?
GateOverflow

Q48.

A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
GateOverflow